Prismatic Sets Associated with Planar Rooted Trees
نویسندگان
چکیده
منابع مشابه
On Balance Index Sets of Rooted Trees
Any vertex labeling f : V → {0, 1} of the graph G = (V, E) induces a partial edge labeling f∗ : E → {0, 1} defined by f∗(uv) = f(u) if and only if f(u) = f(v). The balance index set of G is defined as {|f∗−1(0) − f∗−1(1)| : |f−1(0) − f−1(1)| ≤ 1}. In this paper, we first determine the balance index sets of rooted trees of height not exceeding two, thereby completely settling the problem for tre...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملLeft ternary trees and non-separable rooted planar maps
In this paper, we illustrate a bijective proof of the enumerative formula regarding non-separable rooted planar maps N S, by means of a class L of certain ternary trees (called left trees). Our rst step consists in determining the left trees' combinatorial enumeration according to the number of their internal nodes. We then establish a bijection between the left trees having n internal nodes an...
متن کاملRooted Trees with Probabilities Revisited
Rooted trees with probabilities are convenient to represent a class of random processes with memory. They allow to describe and analyze variable length codes for data compression and distribution matching. In this work, the Leaf-Average Node-Sum Interchange Theorem (LANSIT) and the well-known applications to path length and leaf entropy are re-stated. The LANSIT is then applied to informational...
متن کاملUniversal Point Sets for Planar Three-Trees
For every n ∈ N, we present a set Sn of O(n log n) points in the plane such that every planar 3-tree with n vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of Sn. This is the first subquadratic upper bound on the size of universal point sets for planar 3-trees, as well as for the class of 2-trees and serial parallel graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2019
ISSN: 2314-4629,2314-4785
DOI: 10.1155/2019/1543201